Some Improvements to Turner's Algorithm for Bracket Abstraction
نویسنده
چکیده
A computer handles A-terms more easily if these are translated into combinatory terms. This translation process is called bracket abstraction. The simplest abstraction algorithm-the (fab) algorithm of Curry (see Curry and Feys [6])-is lengthy to implement and produces combinatory terms that increase rapidly in length as the number of variables to be abstracted increases.
منابع مشابه
On the equivalence of different presentations of Turner's bracket abstraction algorithm
Turner’s bracket abstraction algorithm is perhaps the most well-known improvement on simple bracket abstraction algorithms. It is also one of the most studied bracket abstraction algorithms. The definition of the algorithm in Turner’s original paper is slightly ambiguous and it has been subject to different interpretations. It has been erroneously claimed in some papers that certain formulation...
متن کاملExpedited Broda-Damas Bracket Abstraction
A bracket abstraction algorithm is a means of translating λ-terms into combinators. Broda and Damas, in [1], introduce a new, rather natural set of combinators and a new form of bracket abstraction which introduces at most one combinator for each λ-abstraction. This leads to particularly compact combinatory terms. A disadvantage of their abstraction process is that it includes the whole Schonfi...
متن کاملBracket Abstraction Preserves Typability A formal proof of Diller–algorithm–C in PVS
Bracket abstraction is an algorithm that transforms lambda expressions into combinator terms. There are several versions of this algorithm depending on the actual set of combinators that is used. Most of them have been proven correct with respect to the operational semantics. In this paper we focus on typability. We present a fully machine verified proof of the property that bracket abstraction...
متن کاملارزیابی رابطه SCS در تعیین تلفات اولیه باران در حوضه های آبریز
The main scope of this research is evaluation of Soil Conservation Service Procedure in derivation of initial abstraction of precipitation in watershed scale. For this purpose Dalaki watershed which is located in south east of Iran was selected then by using hec-hms and GIS models and a number of observed rainfall runoff events some parameters like CN of watershed ,K and X of Muskingam meth...
متن کاملBracket Abstraction in the Combinator System C`(k)
Translations from lambda calculi to combinatory logics can be used to avoid some implementational problems of the former systems. However, this scheme can only be eecient if the translation produces short output with a small number of combinators, in order to reduce the time and transient storage space spent during reduction of combinatory terms. In this paper we present a combinatory system an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 55 شماره
صفحات -
تاریخ انتشار 1990